A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation

نویسندگان

چکیده

The rational QZ method generalizes the by implicitly supporting subspace iteration. In this paper we extend introducing shifts and poles of higher multiplicity in Hessenberg pencil, which is a pencil consisting two matrices. result multishift, multipole iteration on block pencils allows one to stick real arithmetic for input pencil. combination with optimally packed aggressive early deflation as an advanced technique obtain efficient dense generalized eigenvalue problem. numerical experiments compare results state-of-the-art routines problem show that are competitive terms speed accuracy.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Multishift QZ Algorithm with Aggressive Early Deflation

Recent improvements to the QZ algorithm for solving generalized eigenvalue problems are summarized. Among the major modifications are novel multishift QZ iterations based on chasing chains of tiny bulges and an extension of the so called aggressive early deflation strategy. The former modification aims to improve the execution time of the QZ algorithm on modern computing systems without changin...

متن کامل

Multishift Variants of the QZ Algorithm with Aggressive Early Deflation

Abstract. New variants of the QZ algorithm for solving the generalized eigenvalue problem are proposed. An extension of the small-bulge multishift QR algorithm is developed, which chases chains of many small bulges instead of only one bulge in each QZ iteration. This allows the effective use of level 3 BLAS operations, which in turn can provide efficient utilization of high performance computin...

متن کامل

The Multishift QR Algorithm. Part II: Aggressive Early Deflation

Aggressive early deflation is a QR algorithm deflation strategy that takes advantage of matrix perturbations outside of the subdiagonal entries of the Hessenberg QR iterate. It identifies and deflates converged eigenvalues long before the classic small-subdiagonal strategy would. The new deflation strategy enhances the performance of conventional large-bulge multishift QR algorithms, but it is ...

متن کامل

Parallel library software for the multishift QR algorithm with aggressive early deflation

Library software implementing a parallel small-bulge multishift QR algorithm with aggressive early deflation (AED) targeting distributed memory high-performance computing systems is presented. Starting from recent developments of the parallel multishift QR algorithm [Granat et al., SIAM J. Sci. Comput. 32(4), 2010], we describe a number of algorithmic and implementation improvements. These incl...

متن کامل

Parallel Variants of the Multishift QZ Algorithm with Advanced Deflation Techniques

The QZ algorithm reduces a regular matrix pair to generalized Schur form, which can be used to address the generalized eigenvalue problem. This paper summarizes recent work on improving the performance of the QZ algorithm on serial machines and work in progress on a novel parallel implementation. In both cases, the QZ iterations are based on chasing chains of tiny bulges. This allows to formula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2021

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/19m1249631